Multiplex networks and interest group influence reputation: An exponential random graph model

نویسنده

  • Michael T. Heaney
چکیده

Interest groups struggle to build reputations as influential actors in the policy process and to discern the influence exercised by others. This study conceptualizes influence reputation as a relational variable that varies locally throughout a network. Drawing upon interviews with 168 interest group representatives in the United States health policy domain, this research examines the effects of multiplex networks of communication, coalitions, and issues on influence reputation. Using an exponential random graph model (ERGM), the analysis demonstrates that multiple roles of confidant, collaborator, and issue advocate affect how group representatives understand the influence of those with whom they are tied, after accounting for homophily among interest groups. © 2012 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

Structural and Institutional Determinants of Influence Reputation : A Comparison of Collaborative and Adversarial Policy Networks in Decision Making and Implementation

The central assumption in the literature on collaborative networks and policy networks is that political outcomes are affected by a variety of state and nonstate actors. Some of these actors are more powerful than others and can therefore have a considerable effect on decision making. In this article, we seek to provide a structural and institutional explanation for these power differentials in...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

The Effect of Random Edge Removal on Network Degree Sequence

Many networks arise in a random and distributed fashion, and yet result in having a specific type of degree structure: e.g., the WWW, many social networks, biological networks, etc., exhibit power-law, stretched exponential, or similar degree structures. Much work has examined how a graph's degree-structure influences other graph properties such as connectivity, diameter, etc. Probabilistic edg...

متن کامل

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Social Networks

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2014